#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
map<LL,LL>map1;

struct P{
    LL len,val;
};
stack<P>s;
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        while(!s.empty()) s.pop();
        map1.clear();
        LL n;cin>>n;
        for(LL i=1;i<=n;i++) cin>>a[i],map1[a[i]]=i;
        s.push({1,a[1]});



        for(LL i=2;i<=n;i++){
            if(a[i]==1){
                LL len=s.top().len;
                len++;
                s.push({len,a[i]});
            }
            else{
                if(s.top().val==a[i]-1){
                    LL len=s.top().len;
                    len++;
                    s.push({len,a[i]});
                }
                else{

                    while(!s.empty()&&s.top()!=a[i]-1){
                        s.pop();
                    }
                    LL len=
                }
            }
        }
    }
   	return 0;
}
